Memory-eecient and Self-stabilizing Network Reset Baruch a W Erbuch
نویسندگان
چکیده
In this paper we consider the question of fault-tolerant distributed network protocols with extremely small memory requirements per processor. In particular, we show that even in the case of worst-case transient faults (i.e., in a self-stabilizing setting), many fundamental network protocols can be achieved using only O(log n) bits of memory per incident network edge. In the heart of our construction is a self-stabilizing asynchronous network reset protocol with the same small memory requirements. Johns Hopkins University, Baltimore, MD 21218, and MIT Lab. for Computer Science. E-mail: [email protected]. Supported by Air Force Contract TNDGAFOSR-86-0078, ARPA/Army contract DABT63-93-C-0038, ARO contract DAAL03-86-K-0171,NSF contract 9114440-CCR,DARPA contract N00014-J-92-1799. U.C. Berkeley and ICSI. Supported by NSF postdoctoral fellowship and ICSI. E-mail: [email protected].
منابع مشابه
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., become self-stabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any self-stabilizing internal reset protocol, any locally-checkable protocol can be made self-stabilizing. Our proof is constructive in the ...
متن کاملThe Local Detection Paradigm and itsApplications to Self Stabilization
A new paradigm for the design of self-stabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in de ning a local condition based on the state of a processor and its immediate neighborhood, such that the system is in a globally legal state if and only if the local condition is satis ed at all the nodes. In this work we also extend the model of se...
متن کاملThe Local Detection Paradigm for Self Stabilization
A new paradigm for the design of self-stabilizing distributed algorithms, called local detection, is introduced. The paradigm is to de ne a condition that each node can check locally, such that the condition holds for every node in its immediate neighborhood if and only if the system is in a globally legal state. Following our preliminary presentation [AKY90], this paradigm has been widely used...
متن کاملMemory-Efficient Self Stabilizing Protocols for General Networks
A self stabilizing protocol for constructing a rooted spanning tree in an arbitrary asynchronous network of processors that communicate through sha~ed memory is presented. The processors have unique identifiers but are otherwise identical. The network topology is assumed to be dynamic, that is, edges can join or leave the computation before it eventually stabilizes. The algorithm is design uses...
متن کاملSelf-stabilizing end-to-end communication
Self-stabilizing protocols must begin operating correctly even when started from an arbitrary state. The end-to-end problem is to ensure reliable message delivery across an unreliable network under the weakest possible guarantee from the network { that the sender and receiver are never separated by a cut of permanently failed links. In this paper we present the rst self-stabilizing end-to-end p...
متن کامل